Automorphism groups of root system matroids
نویسندگان
چکیده
Given a root system R, the vector system R̃ is obtained by taking a representative v in each antipodal pair {v,−v}. The matroid M(R) is formed by all independent subsets of R̃. The automorphism group of a matroid is the group of permutations preserving its independent subsets. We prove that the automorphism groups of all irreducible root systems matroids M(R) are uniquely determined by their independent sets of size 3. As a corollary, we compute these groups explicitly, and thus complete the classification of the automorphism groups of root systems matroids.
منابع مشابه
Some Properties of Automorphism Groups of Paving Matroids
This paper deals with the relation between the automorphism groups of some paving matroids and Z3, where Z3 is the additive group of modulo 3 over Z. It concludes that for paving matroids under most cases, Z3 is not isomorphic to the automorphism groups of these paving matroids. Even in the exceptional cases, we reasonably conjecture that Z3 is not isomorphic to the automorphism groups of the c...
متن کاملOn the asymptotic proportion of connected matroids
Very little is known about the asymptotic behaviour of classes of matroids. We make a number of conjectures about such behaviours. For example, we conjecture that asymptotically almost every matroid: has a trivial automorphism group; is arbitrarily highly connected; and, is not representable over any field. We prove one result: The proportion of labeled n-element matroids that are connected is ...
متن کاملOn Outer Automorphism Groups of Coxeter Groups
It is shown that the outer automorphism group of a Coxeter group W of nite rank is nite if the Coxeter graph contains no innnite bonds. A key step in the proof is to show that if the group is irreducible and 1 and 2 any two bases of the root system of W, then 2 = w 1 for some w 2 W. The proof of this latter fact employs some properties of the dominance order on the root system introduced by Bri...
متن کاملOn the Complexity of Matroid Isomorphism Problems
We study the complexity of testing if two given matroids are isomorphic. The problem is easily seen to be in Σ 2 . In the case of linear matroids, which are represented over polynomially growing fields, we note that the problem is unlikely to be Σ 2 -complete and is coNPhard. We show that when the rank of the matroid is bounded by a constant, linear matroid isomorphism and matroid isomorphism a...
متن کاملMatroid Automorphisms of the Root System F4
Let F4 be the root system associated with the 24-cell, and let M(F4) be the simple linear dependence matroid corresponding to this root system. We determine the automorphism group of this matroid and compare it to the Coxeter group W for the root system. We find non-geometric automorphisms that preserve the matroid but not the root system.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Eur. J. Comb.
دوره 32 شماره
صفحات -
تاریخ انتشار 2011